منابع مشابه
Quantum automata and algebraic groups
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.
متن کاملC * -algebraic Quantum Groups Arising from Algebraic Quantum Groups
We associate to an algebraic quantum group a C *-algebraic quantum group and show that this C *-algebraic quantum group essentially satisfies an upcoming definition of Masuda, Nakagami & Woronowicz.
متن کاملAlgebraic Quantum Permutation Groups
We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If K is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra K: this is a refinement of Wang’s universality theorem for the (compact) quantum permutation group. We also prove a structural result for Hopf algebras having a non-...
متن کاملAlgebraic methods: Lie groups, quantum groups
These notes concentrate on the paradigm of spherical functions on Riemannian symmetric spaces. This paradigm has led to the notion of special functions associated with root systems. The first sections deal with older work on the interaction between spherical functions on rank one symmetric spaces and special functions (q=1) in one variable. The (spectacular) developments in the higher rank case...
متن کاملApplications of Algebraic Automata Theory to Quantum Finite Automata
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2004.11.008